Some Thoughts on the Equivalence of Systematic and Non-Systematic Convolutional Encoders∗

نویسندگان

  • Daniel J. Costello
  • Hermano A. Cabral
  • Oscar Y. Takeshita
چکیده

In this paper, we re-examine the notion of equivalent systematic and non-systematic convolutional encoders within the context of turbo coding. In particular, we argue that using equivalent systematic and non-systematic constituent encoders in a parallel concatenated system does not yield the same performance. In fact, the performance can differ greatly, depending on the effective free distance and the encoder mapping. Since non-systematic encoders typically have larger effective free distances than their systematic counterparts, they are better in the “error floor”, or low BER, region of the performance curve. On the other hand, since systematic encoders typically have better encoder mappings than non-systematic encoders, they are better in the “waterfall”, or high BER, region of the performance curve.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A search for good convolutional codes to be used in the construction of turbo codes

Recursive systematic convolutional encoders have been shown to play a crucial role in the design of turbo codes. We recall some properties of binary convolutional encoders and apply them to a search for good constituent convolutional codes of turbo codes. Tables of the “best” recursive systematic convolutional encoders found are presented for various rates, together with the average bit-error p...

متن کامل

High-rate systematic recursive convolutional encoders: minimal trellis and code search

We consider high-rate systematic recursive convolutional encoders to be adopted as constituent encoders in turbo schemes. Douillard and Berrou showed that, despite its complexity, the construction of high-rate turbo codes by means of high-rate constituent encoders is advantageous over the construction based on puncturing rate-1/2 constituent encoders. To reduce the decoding complexity of high-r...

متن کامل

Systematic encoders for convolutional codes and their application to turbo codes

Abst rac t Systematic recursive convolutional encoders have been shown to play a crucial role in the design and implementation ofparallel concatenated codes (“turbo codes77). We present here a canonical structure of minimal linear systematic rate k / n encoders and use it in the search for good constituent codes of parallel concatenated codes. Tables of the best encoders for various rates are a...

متن کامل

Systematic Feed-Forward Convolutional Encoders Are Better than Other Encoders with an M-Algorithm Decoder

Consider nonbacktracking convolutional decoders that keep a fixed number of trellis survivors. It is shown that the error performance of these depends on the early part of the distance profile and on the number of survivors kept, and not on the free distance or the details of the code generators. Particularly, the encoder may be feedforward systematic without loss. Furthermore, this kind of enc...

متن کامل

Some Extended Results on the Design of Punctured Serially Concatenated Convolutional Codes

The aim of this paper is twofold. On one hand, it presents the results of the search for good punctured systematic recursive convolutional encoders suitable for application in serially concatenated convolutional codes (SCCCs) operating in two different target regions: at low-to-moderate signal-to-noise ratios (SNRs), i.e., in the so-called waterfall region, and at high SNRs. On the other hand, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001